Functional behavior of nondeterministic and concurrent programs
نویسندگان
چکیده
منابع مشابه
Implementations of Nondeterministic Programs
Non-determinism is widely recognized as a valuable tool for program development [Dijkstra 1976]. It appears also as the natural environment for the , evolution of systems of parallel processes; sequential implementation of such systems through non-deterministically simulating their distributed behaviour can be an effective programming technique [Guerreiro 1981, 1983b]. Furthermore, the concept ...
متن کاملMechanized Reasoning about Concurrent Functional Programs
Various mechanisms have been used for adapting functional languages to parallel machines, ranging from semantics{preserving annotations to concurrent language extensions. Concurrent extensions are applicable to both lazy and strict languages, and give the programmer full control over parallel evaluation; however, they complicate the proofs of program correct-ness. This paper pursues the concurr...
متن کاملthe effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولCorrectness and Refinement of Dually Nondeterministic Programs
In this paper we extend different reasoning methods from traditional (demonic) programs to programs with both demonic and angelic nondeterminism. In particular, we discuss correctness proofs, and refinement of programs while reducing angelic nondeterminism (into demonic nondeterminism or determinism). As expected, reducing angelic nondeterminism is generally not a refinement; however, when cont...
متن کاملTest Generation for Concurrent Programs Modeled by Communicating Nondeterministic Finite State Machines1
We present a method of generating test cases for concurrent programs. The specifications of concurrent programs are modeled by a set of communicating nondeterministic finite state machines (CNFSMs), where the CNFSM model is a simplified model derived from CCITT SDL. A conformance relation, called trace-equivalence, is defined under this model, which serves as a guide to test generation. A test ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80032-7